#include <iostream>
#include <algorithm>
#include <cstdio>
#include <array>
#include <map>
#include <bitset>
#include <vector>
using namespace std;
#ifdef ONLINE_JUDGE

#define getchar() (p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 1 << 21, stdin), p1 == p2) ? EOF : *p1++)
char buf[1 << 23], *p1 = buf, *p2 = buf, ubuf[1 << 23], *u = ubuf;

#endif
int read() {
    int p = 0, flg = 1;
    char c = getchar();
    while (c < '0' || c > '9') {
        if (c == '-') flg = -1;
        c = getchar();
    }
    while (c >= '0' && c <= '9') {
        p = p * 10 + c - '0';
        c = getchar();
    }
    return p * flg;
}
void write(int x) {
    if (x < 0) {
        x = -x;
        putchar('-');
    }
    if (x > 9) {
        write(x / 10);
    }
    putchar(x % 10 + '0');
}
bool _stmer;

const int N = 1005;

map <vector <int>, bool> mp;
vector <int> tp;

array <int, N> s, h;
bitset <N> vis1, vis2;

void dfs(int x, int y, int n) {
    if (x == n && y == n) {
        mp[tp] = 1;
        return;
    }
    if (x != n) tp.push_back(h[y]), dfs(x + 1, y, n), tp.pop_back();
    if (y != n) tp.push_back(s[x]), dfs(x, y + 1, n), tp.pop_back();
}

bool _edmer;
int main() {
    cerr << (&_stmer - &_edmer) / 1024.0 / 1024.0 << "MB\n";
#ifndef cxqghzj
    freopen("zha.in", "r", stdin);
    freopen("zha.out", "w", stdout);
#endif
    int n = read();
    for (int i = 1; i <= n; i++) s[i] = read();
    for (int i = 1; i <= n; i++) h[i] = read();
    dfs(1, 1, n);
    write(mp.size()), puts("");
    return 0;
}
